High-Rate Short-Block LDPC Codes for Iterative Decoding with Applications to High-Density Magnetic Recording Channels

نویسندگان

  • Damian A. Morero
  • Graciela Corral-Briones
  • Carmen E. Rodríguez
  • Mario Rafael Hueda
چکیده

This paper investigates the Triangle Single Parity Check (T/SPC) code, a novel class of high-rate low-complexity LDPC codes. T/SPC is a regular, soft decodable, linear-time encodable/decodable code. Compared to previous high-rate and low-complexity LDPC codes, such as the well-known Turbo Product Code / Single Parity Check (TPC/SPC), T/SPC provides higher code rates, shorter code words, and lower complexity. This makes T/SPC very attractive for practical implementation on integrated circuits. In addition, we analyze the performance of iterative decoders based on a soft-input soft-output (SISO) equalizer using T/SPC over high-density perpendicular magnetic recording channels. Computer simulations show that the proposed scheme is able to achieve a gain of up to 0.3 dB over TPC/SPC codes with a significant reduction of implementation complexity.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Thresholds for Iterative Equalization of Partial Response Channels Using Density Evolution

This paper focuses on the computing of the thresholds for iterative equalization and decoding of partial response channel, such as what are of interest in high density magnetic recording. Extensive simulations on the performance of turbo codes, low density parity check (LDPC) codes and single-parity check turbo product codes (TPC/SPC) over partial response channels reveal very encouraging bit e...

متن کامل

Reduced-Complexity Decoding of Low Density Parity Check Codes for Generalized Partial Response Channels

The performance of low-density parity-check (LDPC) codes serially concatenated with generalized partial response channels is investigated. Various soft-input/soft-output detection schemes suitable for use in iterative detection/decoding systems are described. A low-complexity near-optimal detection algorithm that incorporates soft-input reliability information and generates soft-output reliabil...

متن کامل

A Class of High-rate, Low-complexity, Well- structured LDPC Codes from Combinatorial Designs and their Applications on ISI Channels

We present a systematic construction of a class of highrate, well-structured low density parity check (LDPC) codes based on combinatorial designs. We show that the proposed -design results in a class of -regular LDPC codes, which are systematic, quasicyclic, free of length-4 and length-6 cycles, linear-time encodable and decodable, and which have high code rates of . Analysis from the maximum l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1104.1457  شماره 

صفحات  -

تاریخ انتشار 2011